#include <iostream>
//#include "main/test_list/test_linkedlist.h"
#include "main/src/linked_list/static_linked_list.h"
#include "main/test/test_base/test_scanf.h"
#include "main/test/test_base/test_printf.h"
#include "main/src/linked_list/double_direction_linked_list.h"
#include "main/test/test_list/test_double_direction_linked_list.h"
#include "main/test/test_list/test_polynomial_linked_list.h"
#include "main/test/test_base/test_memory.h"
#include "main/test/test_stack/test_stack.h"
#include "main/test/test_stack/test_stack_use1_conversion.h"
#include "main/src/linear_stack/stack_use2_brackets.h"
#include "main/test/test_base/test_debug.h"
#include "main/test/test_base/test_char_arr.h"
#include "main/test/test_stack/test_maze.h"
#include "main/test/test_base/test_log.h"
#include "main/test/test_stack/test_stack_use5_expression.h"
#include "main/test/test_stack/test_stack_use6_hanoi.h"
#include "main/test/test_queue/test_linked_queue.h"
#include "main/test/test_queue/test_linear_queue.h"
#include "main/test/test_base/test_macro.h"
#include "main/test/test_binary_tree/test_binary_tree.h"

int main() {
//    testCreateList();
//    testMergeLinkedList();
//    test_static_linked_list();
//    test_scanf();
//    test_printf();
//    test_double_direction_linked_list();
//    test_polynomial_linked_list();
//    test_free_memory();
//    test_stack();
//    test_stack_use1_conversion();
//    test_brackets();
//    test_debug();
//    test_char_arr();
//    test_char_arr2();
//    test_maze();
//    testLog();
//    test_memset();
//    test_stack_use5_expression();
//    test_hanoi();
//    test_linked_queue();
//    test_linear_queue();
//    test_macro();

    test_binary_tree();

    return 0;
}
